The weighted hook-length formula II: Complementary formulas
نویسنده
چکیده
Let λ = (λ1, λ2, . . . , λl), λ1 ≥ λ2 ≥ . . . ≥ λl > 0, be a partition of n, λ ⊢ n, and let [λ] = {(i, j) ∈ Z : 1 ≤ i ≤ l, 1 ≤ j ≤ λi} be the corresponding Young diagram. The conjugate partition λ is defined by λj = max{i : λi ≥ j}. We will freely use implications such as i ≤ j ⇒ λi ≥ λj. The hook Hz ⊆ [λ] is the set of squares weakly to the right and below of z = (i, j) ∈ [λ], and the hook length hz = hij = |Hz| = λi + λ ′ j − i − j + 1 is the size of the hook. See Figure 1, left drawing.
منابع مشابه
A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families
We propose an expansion technique for weighted tree families, which unifies and extends recent results on hook-length formulas of trees obtained by Han [10], Chen et al. [3], and Yang [19]. Moreover, the approach presented is used to derive new hook-length formulas for tree families, where several hook-functions in the corresponding expansion formulas occur in a natural way. Furthermore we cons...
متن کاملHook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications
The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In [MPP1] we gave two different q-analogues of Naruse’s formula: for the skew Schur functions, and for counting reverse plane partitions of skew shapes. In this paper we give an elementary proof of Naruse’...
متن کاملThe Weighted Hook Length Formula III: Shifted Tableaux
Recently, a simple proof of the hook length formula was given via the branching rule. In this paper, we extend the results to shifted tableaux. We give a bijective proof of the branching rule for the hook lengths for shifted tableaux; present variants of this rule, including weighted versions; and make the first tentative steps toward a bijective proof of the hook length formula for d-complete ...
متن کاملOn Han's Hook Length Formulas for Trees
Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han’s formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang’s extension. We give combinatorial proofs of Yang’s formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees ass...
متن کاملThe weighted hook length formula
Abstract. Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The first proof is completely bijective, and in a special case gives a new short combinatorial proof of the hook length formula. Our second proof is probabilistic, generalizing the (usual) hook walk proof of Green-Nijenhuis-Wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011